Exponential Decay of Intersection Volume With Applications on List-Decodability and Gilbert-Varshamov Type Bound

نویسندگان

چکیده

We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the is (i) expanding and (ii) well-spread, (iii) certain random variable on boundary of ball has tail. As applications, we show that volume intersection Hamming, Johnson spaces symmetric groups decay exponentially as their centers drift apart. To verify condition (iii), prove large deviation inequalities ‘on slice’ functions with Lipschitz conditions. then use these estimates volumes 1) obtain sharp lower bound list-decodability q-ary codes, confirming conjecture Li Wootters, 2) improve classical Levenshtein from 1971 constant weight codes by factor linear dimension, resolving problem raised Jiang Vardy. Our probabilistic point view also offers unified framework improvements other Gilbert-Varshamov type bounds, giving conceptually simple calculation-free proofs $q$ -ary permutation spherical codes. Another consequence counting result number showing ampleness

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strengthening the Gilbert–Varshamov bound

The paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound for linear codes. The unifying idea is to study a certain graph constructed on vectors of low weight in the cosets of the code, which we call the Varshamov graph. Various simple estimates of the number of its connected components account for better lower bounds on the minimum distance of codes, some of t...

متن کامل

Notes 2 : Gilbert - Varshamov bound

There is a natural greedy approach to construct a code of distance at least d: start with any codeword, and keep on adding codewords which have distance at least d from all previously chosen codewords, until we can proceed no longer. Suppose this procedure halts after picking a code C. Then Hamming balls in {0, 1, . . . , q−1}n of radius d−1 centered at the codewords of C must cover the whole s...

متن کامل

Lengthening and the Gilbert-Varshamov bound

We use lengthening and an enhanced version of the Gilbert-Varshamov lower bound for linear codes to construct a large number of record-breaking codes. Our main theorem may be seen as a closure operation on data bases.

متن کامل

Improved Gilbert-Varshamov bound for constrained systems

Nonconstructive existence results are obtained for block error-correcting codes whose codewords lie in a given constrained system. Each such system is defined as a set of words obtained by reading the labels of a finite directed labelled graph. For a prescribed constrained system and relative minimum distance δ, the new lower bounds on the rate of such codes improve on those derived recently by...

متن کامل

A Gilbert-Varshamov type bound for Euclidean packings

This paper develops a method to obtain a Gilbert-Varshamov type bound for dense packings in the Euclidean spaces using suitable lattices. For the Leech lattice the obtained bounds are quite reasonable for large dimensions, better than the Minkowski-Hlawka bound, but not as good as the lower bound given by Keith Ball in 1992.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2023

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2022.3232241